Ranking Revision with Conditional Knowledge Bases
نویسنده
چکیده
We introduce a new model for belief dynamics where the belief states are ranking measures and the informational inputs are finite sets of parametrized conditionals interpreted by ranking constraints. The approach is inspired by the minimal information paradigm and generalizes ranking construction strategies developed for default reasoning. We show its handling of principles for conditional and parallel revision.
منابع مشابه
Variable-Strength Conditional Preferences for Ranking Objects in Ontologies
We introduce conditional preference bases as a means for ranking objects in ontologies. Conditional preference bases consist of a description ogic knowledge base and a finite set of conditional preferences, which are statements of the form “generally, in the context φ, property α is referred over property ¬α with strength s”. They are inspired by variable-strength defaults in conditional knowle...
متن کاملVariable-Strength Conditional Preferences for Matchmaking in Description Logics
We present an approach to variable-strength conditional preferences for matchmaking and ranking objects in description logics. In detail, we introduce conditional preference bases, which consist of a description logic knowledge base and a finite set of variable-strength conditional preferences, and which are associated with a formal semantics based on ranking functions. We then define the notio...
متن کاملOptimal Belief Revision
We propose a new approach to belief revision that provides a way to change knowledge bases with a minimum of effort. We call this way of revising belief states optimal belief revision. Our revision method gives special attention to the fact that most belief revision processes are directed to a specific informational objective. This approach to belief change is founded on notions such as optimal...
متن کاملComputing multiple c-revision using OCF knowledge base
Belief revision is the process of revising epistemic states in the light of new information. In this paper epistemic states are represented in the framework of Spohn’s Ordinal Conditional Functions (OCF). The input is a consistent set of propositional formulas issued from different and independent sources. We focus on the so-called multiple iterated belief crevision recently proposed by Kern-Is...
متن کاملMeta Levels in Conditional Logics
First, we present a formal account of splitting a knowledge base into two parts, expanding our previous results motivated by avoiding the GG ardenfors triviality results for revision semantics for condition-als. Second, we propose a speciic revision function and show that this function is optimal in the sense, that after revision as few conditional consequences as possible are changed. Third, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010